Over-indebted Households in Poland: Classification Tree Analysis
نویسندگان
چکیده
منابع مشابه
Indebted households profiling: a knowledge discovery from database approach
A major challenge in consumer credit risk portfolio management is to classify households according to their risk profile. In order to build such risk profiles it is necessary to employ an approach that analyses data systematically in order to detect important relationships, interactions, dependencies and associations amongst the available continuous and categorical variables altogether and accu...
متن کاملClassification tree analysis using TARGET
Treemodels are valuable tools for predictivemodeling and datamining. Traditional tree-growingmethodologies such as CART are known to suffer from problems including greediness, instability, and bias in split rule selection. Alternative tree methods, including Bayesian CART (Chipman et al., 1998; Denison et al., 1998), random forests (Breiman, 2001a), bootstrap bumping (Tibshirani and Knight, 199...
متن کاملBayes-optimal Hierarchical Classification over Asymmetric Tree-Distance Loss
Hierarchical classification is supervised multi-class classification problem over the set of class labels organized according to a hierarchy. In this report, we study the work by Ramaswamy et. al. on hierarchical classification over symmetric tree distance loss. We extend the consistency of hierarchical classification algorithm over asymmetric tree distance loss. We design a $\mathcal{O}(nk\log...
متن کاملClassification by decision tree induction over a medical database
Classification by decision tree induction is a well known technique in machine learning [1],[2]. Many different methods to grow decision trees have been described[3],[4]. In this second phase of the project on a database of 868 patients admitted in a stroke unit at the Trieste hospital, we have tried 28 different attribute selection measures (14 regular and 14 1-level lookahead versions of the ...
متن کاملPrivacy-Preserving Decision Tree Classification Over Horizontally Partitioned Data
Protection of privacy is one of important problems in data mining. The unwillingness to share their data frequently results in failure of collaborative data mining. This paper studies how to build a decision tree classifier under the following scenario: a database is horizontally partitioned into multiple pieces, with each piece owned by a particular party. All the parties want to build a decis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Indicators Research
سال: 2020
ISSN: 0303-8300,1573-0921
DOI: 10.1007/s11205-020-02505-6